On Structural Signatures for Tree Data Structures
نویسندگان
چکیده
In this paper, we present new attacks on the redactable signature scheme introduced by Kundu and Bertino at VLDB ’08. This extends the work done by Brzuska et al. at ACNS ’10 and Samelin et al. at ISPEC ’12. The attacks address unforgeability, transparency and privacy. Based on the ideas of Kundu and Bertino, we introduce a new provably secure construction. The corresponding security model is more flexible than the one introduced by Brzuska et al. Moreover, we have implemented schemes introduced by Brzuska et al. and Kundu and Bertino. The evaluation shows that schemes with a quadratic complexity become unuseable very fast.
منابع مشابه
Structural signatures for tree data structures
Data sharing with multiple parties over a third-party distribution framework requires that both data integrity and confidentiality be assured. One of the most widely used data organization structures is the tree structure. When such structures encode sensitive information (such as in XML documents), it is crucial that integrity and confidentiality be assured not only for the content, but also f...
متن کاملPerformance Evaluation of Parallel S
The S-tree is a dynamic height-balanced tree similar in structure to B + trees. S-trees store xed length bit-strings, which are called signatures. Signatures are used for indexing textbases, relational, object oriented and extensible databases as well as in data mining. In this article, methods of designing multi-disk B-trees are adapted to S-trees and new methods of parallelizing S-trees are d...
متن کاملPerformance Evaluation of Parallel S-Trees
The S-tree is a dynamic height-balanced tree similar in structure to B + trees. S-trees store xed length bit-strings, which are called signatures. Signatures are used for indexing textbases, relational, object oriented and extensible databases as well as in data mining. In this article, methods of designing multi-disk B-trees are adapted to S-trees and new methods of parallelizing S-trees are d...
متن کاملSteel Buildings Damage Classification by damage spectrum and Decision Tree Algorithm
Results of damage prediction in buildings can be used as a useful tool for managing and decreasing seismic risk of earthquakes. In this study, damage spectrum and C4.5 decision tree algorithm were utilized for damage prediction in steel buildings during earthquakes. In order to prepare the damage spectrum, steel buildings were modeled as a single-degree-of-freedom (SDOF) system and time-history...
متن کاملExploring Gene Signatures in Different Molecular Subtypes of Gastric Cancer (MSS/ TP53+, MSS/TP53-): A Network-based and Machine Learning Approach
Gastric cancer (GC) is one of the leading causes of cancer mortality, worldwide. Molecular understanding of GC’s different subtypes is still dismal and it is necessary to develop new subtype-specific diagnostic and therapeutic approaches. Therefore developing comprehensive research in this area is demanding to have a deeper insight into molecular processes, underlying these subtypes. In this st...
متن کاملOn Coherent Structures of Turbulent Open-channel Flow Above a Rough Bed
Present study examines turbulent structures of a rough bed open-channel flow in the context of deterministic approach. Instantaneous velocity field is measured in different hydraulic conditions using two dimensional Particle Image Velocimetry (PIV) in vertical plane and Stereoscopic PIV in horizontal plane. Different techniques and quantities such as swirl strength, two-point and cross-correlat...
متن کامل